Reduced k -to-1 maps and graphs with no k -to-1 cut set
نویسندگان
چکیده
منابع مشابه
Irreducible k-to-1 Maps Onto Grids
In this paper we explore the existence of exactly k-to-1 continuous functions between graphs, and more specifically 2-to-1 continuous function between graphs that are irreducibly 2-to-1, meaning that no restriction of the function to a subgraph is 2-to-l. We show how to construct such functions in some general cases, and then more specifically onto rectangular grids. We have in mind an applicat...
متن کاملMinimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملMany collinear k-tuples with no k+1 collinear points
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
متن کاملPlanar k-cycle resonant graphs with k=1, 2
A connected graph is said to be k-cycle resonant if, for 16 t6 k, any t disjoint cycles in G are mutually resonant, that is, there is a perfect matching M of G such that each of the t cycles is an M -alternating cycle. The concept of k-cycle resonant graphs was introduced by the present authors in 1994. Some necessary and su6cient conditions for a graph to be k-cycle resonant were also given. I...
متن کاملWiggles and Finitely Discontinuous k-to-1 Functions Between Graphs
The graphs we shall consider are topological graphs that is they lie in R3 and each edge is homeomorphic to [0, 1]. If a graph is simple, that is it has no loops or multiple edges, then each edge may be taken to be a straight line joining the two vertices at the ends of the edge. A function is k-to-1 if each point in the codomain has precisely k preimages in the domain. Given two graphs G and H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2000
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(99)00067-x